On Delphi lemmas and other memoing techniques for deterministic logic programs
نویسندگان
چکیده
منابع مشابه
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs
Three orthogonal memoing techniques for deterministic logic programs are introduced and evaluated on the basis of their empirical performance. They share the same basic idea: eecient memoing is achieved by losing information gracefully, i.e., memoing beneets from a form of abstraction. Abstract answers are most general computed answers of deterministic logic programs obtained through repeated a...
متن کاملNon Deterministic Logic Programs
Non deterministic applications arise in many domains, including, stochastic optimization, multi-objectives optimization, stochastic planning, contingent stochastic planning, reinforcement learning, reinforcement learning in partially observable Markov decision processes, and conditional planning. We present a logic programming framework called non deterministic logic programs, along with a decl...
متن کامل5. Conclusion and Future Directions
A new declarative semantics for logic languages. In R. Optimizations of bottom-up evaluation with non-ground terms. In Miller 15], pages 557{574. 19 orthogonal to the type of program to which memoing is applied. With some care, they can be used in the context of full Prolog, speciied as we have suggested by a programmer controlled directive. The practicality of the special case of ground, multi...
متن کاملA Deterministic Operational Semantics for Functional Logic Programs
This paper introduces a deterministic operational semantics for functional logic programs including notions like laziness, sharing, concurrency, non-deterministic functions, etc. Our semantic description is important not only to provide appropriate language definitions to reason about programs and check the correctness of implementations but it is also a basis to develop language-specific tools...
متن کاملInconsistency lemmas in algebraic logic
In this paper, the inconsistency lemmas of intuitionistic and classical propositional logic are formulated abstractly. We prove that, when a (finitary) deductive system ` is algebraized by a variety K, then ` has an inconsistency lemma—in the abstract sense—iff every algebra in K has a dually pseudo-complemented join semilattice of compact congruences. In this case, the following are shown to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00105-7